Polylidar - Polygons From Triangular Meshes
نویسندگان
چکیده
منابع مشابه
Approximating Uniform Triangular Meshes in Polygons
Given a convex polygon P in the plane and a positive integer n, we consider the problem of generating a length-uniform triangular mesh for the interior of P using n Steiner points. More specifically, we want to find both a set Sn of n points inside P , and a triangulation of P using Sn, with respect to the following minimization criteria: (1) ratio of the maximum edge length to the minimum one,...
متن کاملNavigation Queries from Triangular Meshes
Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. This paper explores the use of triangulations as a navigation mesh, and discusses several useful triangulation–based algorithms and operations: environment modeling and validity, automatic agent placement, tracking moving obsta...
متن کاملRay Tracing Triangular Meshes
This paper describes two approaches that allow us to intersect rays with triangular meshes more quickly by amortizing computation over neighbouring triangles. The first approach accomplishes this by performing the in-out test for each triangle using three plane equations, each one representing a boundary edge for the triangle. Each plane is shared between four neighbouring triangles and the cos...
متن کاملSubdivision Curves on Triangular Meshes
Subdivision curves have great importance for many CAD/CAM applications. In this paper we propose a simple method to define subdivision schemes on triangulations. It works by translating to the triangulation a perturbation of a planar binary subdivision. To reproduce this perturbation in the surface we use both, shortest and straightest geodesics, so we call this strategy intrinsic projection me...
متن کاملComputing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian’s Fast Marching Method and Polthier’s straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces. r 2005 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2020
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2020.3002212